Higher order composition Runge-Kutta methods
نویسندگان
چکیده
منابع مشابه
High Order Runge { Kutta Methods on Manifolds
This paper presents a family of Runge{Kutta type integration schemes of arbitrarily high order for di erential equations evolving on manifolds. We prove that any classical Runge{Kutta method can be turned into an invariant method of the same order on a general homogeneous manifold, and present a family of algorithms that are relatively simple to implement.
متن کاملHigh Order Multisymplectic Runge-Kutta Methods
We study the spatial semidiscretizations obtained by applying Runge–Kutta (RK) and partitioned Runge–Kutta (PRK) methods to multisymplectic Hamiltonian partial differential equations. These methods can be regarded as multisymplectic hp-finite element methods for wave equations. All the methods we consider are multisymplectic; we determine their properties with regard to existence of solutions, ...
متن کاملRunge - Kutta Methods page RK 1 Runge - Kutta Methods
Literature For a great deal of information on Runge-Kutta methods consult J.C. Butcher, Numerical Methods for Ordinary Differential Equations, second edition, Wiley and Sons, 2008, ISBN 9780470723357. That book also has a good introduction to linear multistep methods. In these notes we refer to this books simply as Butcher. The notes were written independently of the book which accounts for som...
متن کاملAdaptive higher-order finite element methods for transient PDE problems based on embedded higher-order implicit Runge-Kutta methods
We present a new class of adaptivity algorithms for time-dependent partial differential equations (PDE) that combines adaptive higher-order finite elements (hp-FEM) in space with arbitrary (embedded, higher-order, implicit) Runge-Kutta methods in time. Weak formulation is only created for the stationary residual of the equation, and the Runge-Kutta method is supplied via its Butcher’s table. Ar...
متن کاملAccelerated Runge-Kutta Methods
Standard Runge-Kutta methods are explicit, one-step, and generally constant step-size numerical integrators for the solution of initial value problems. Such integration schemes of orders 3, 4, and 5 require 3, 4, and 6 function evaluations per time step of integration, respectively. In this paper, we propose a set of simple, explicit, and constant step-size Accerelated-Runge-Kutta methods that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tamkang Journal of Mathematics
سال: 2008
ISSN: 2073-9826,0049-2930
DOI: 10.5556/j.tkjm.39.2008.12